排序方式: 共有188条查询结果,搜索用时 15 毫秒
1.
2.
王京齐 《海军工程大学学报》2003,15(4):65-68
阐明了潜艇承载力图谱的一种新算法,分析了危险舵卡的基本挽回方法及其衡准,论述了当前水下动力抗沉的实用方法及评价指标. 相似文献
3.
为了准确评估锈蚀RC梁的剩余抗剪承载力,在对6根既有纵筋、箍筋锈蚀都比较严重的混凝土抗弯构件进行了剩余抗剪承力试验研究的基础上,提出了锈蚀RC梁的剩余抗剪承载力计算公式.结果表明,既有锈蚀RC梁挠度曲线没有明显的开裂拐点;破坏时脆性明显,裂缝集中在某一处,间距较大,破坏荷载和屈服荷载接近,受剪破坏形态可能表现为加载点下垂直裂缝引起的破坏.所提出的既有锈蚀RC梁剩余抗剪承载力计算公式与试验结果吻合较好,可为锈蚀RC梁剩余抗剪承载力评估提供一定参考. 相似文献
4.
赵建平 《中国人民武装警察部队学院学报》2009,25(12):68-69
安全事故频发,引发部队管理危机,究其原因是多方面的,但是,管理中的"三弱化"是主因。如何提升管理中的执行力,应从四个方面入手,即强化培训式管理、走动式管理、数字化管理、问责制管理。夯实执行根基,提升执行监管,量化执行标准,重施执行奖惩,确保消防部队管理执行力的提升,是减少安全事故,确保部队高度安全稳定的根本途径。 相似文献
5.
6.
文献[1]~[3]中研究了神经网络的能力—存储能力。但我们认为神经网络的能力应包括存储能力和计算能力两个方面。本文对神经网络的存储能力和计算能力进行定量分析,并得出了许多有益的结论。 相似文献
7.
Sarah M. Ryan 《海军后勤学研究》2003,50(2):167-183
The combination of uncertain demand and lead times for installing capacity creates the risk of shortage during the lead time, which may have serious consequences for a service provider. This paper analyzes a model of capacity expansion with autocorrelated random demand and a fixed lead time for adding capacity. To provide a specified level of service, a discrete time expansion timing policy uses a forecast error‐adjusted minimum threshold level of excess capacity position to trigger an expansion. Under this timing policy, the expansion cost can be minimized by solving a deterministic dynamic program. We study the effects of demand characteristics and the lead time length on the capacity threshold. Autocorrelation acts similarly to randomness in hastening expansions but has a smaller impact, especially when lead times are short. However, the failure either to recognize autocorrelation or to accurately estimate its extent can cause substantial policy errors. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003 相似文献
8.
针对以常规母联开关互联的交流电网线路变压器容量无法合理利用的问题,提出了依靠由背靠背电压源变流器组成的新型大功率柔性互联装置实现两侧交流电网有功功率互济的协调控制方法。介绍了新型柔性互联装置的拓扑结构与基本的控制原理,为实现两侧线路变压器容量合理的目标制定了一种生成有功功率参考的方法,并基于PSCAD/EMTDC搭建了一套仿真算例,对新型柔性互联装置的基本控制与所提出的有功互济的协调控制方法进行了验证。仿真结果表明,在柔性互联装置采用所提方法时能够实现两侧交流线路的有功功率互济,解决了线路变压器容量无法合理分配的问题。 相似文献
9.
In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
10.
Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness 下载免费PDF全文
We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines Mj, and the Mj subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017 相似文献